Probabilistic analysis of causal message ordering
نویسنده
چکیده
Causal message ordering (CMO) demands that messages directed to the same destinations must be delivered in an order consistent with their potential causality. In this paper, we present a modular decomposition of CMO, and evaluate the probability of breaking CMO by assuming two probabilistic models on message delays: exponential distribution and uniform distribution. These models represent the contexts where message delays are unpredictable and, respectively, unbounded and bounded. Our analysis result helps understanding the necessity of CMO schemes, and suggests a probabilistic approach to CMO: deferredsending. The effect of deferred-sending is analyzed.
منابع مشابه
Algorithms for Causal Message Ordering in Distributed Systems
Causal message ordering is a partial ordering of messages in a distributed computing environment. It places a restriction on communication between processes by requiring that if the transmission of messagemi to process pk necessarily preceded the transmission of message mj to the same process, then the delivery of these messages to that process must be ordered such that mi is delivered before m...
متن کاملA Causal Multicast Protocol for Mobile Distributed Systems
Causal message ordering in the context of group communication ensures that all the message receivers observe consistent ordering of events affecting a group as a whole. This paper presents a scalable causal multicast protocol for mobile distributed computing systems. In our protocol, only a part of the mobility agents in the system is involved in group computations and the resulting size of con...
متن کاملImplementing Causal Ordering with Bounded Time stamps
This paper investigates a solution to the problem of causal ordering in message passing distributed systems Causal ordering is the restriction that messages are delivered in a fo fashion with respect to the global causal order between events in the system This is stronger than the condition that each local channel is fo In our algorithm causal ordering is implemented by having each process main...
متن کاملCausal Order Multicast Protocol Using Different Information from Brokers to Subscribers
Recently, in Publish/Subscribe (P/S) systems, there has been increasing emphasis in managing end-to-end message delivery performance and message order-based consistency, which are addressed in distributed collaborative applications for on-the-fly data. A causal message ordering is more useful for these distributed applications in which a large number of processes request collaboratively and int...
متن کاملEnergy-Aware Probabilistic Epidemic Forwarding Method in Heterogeneous Delay Tolerant Networks
Due to the increasing use of wireless communications, infrastructure-less networks such as Delay Tolerant Networks (DTNs) should be highly considered. DTN is most suitable where there is an intermittent connection between communicating nodes such as wireless mobile ad hoc network nodes. In general, a message sending node in DTN copies the message and transmits it to nodes which it encounters. A...
متن کامل